On the Complexity of Variations of Equal Sum Subsets
نویسندگان
چکیده
The Equal Sum Subsets problem, where we are given a set of positive integers and we ask for two nonempty disjoint subsets such that their elements add up to the same total, is known to be NP-hard. In this paper we give (pseudo-)polynomial algorithms and/or (strong) NP-hardness proofs for several natural variations of Equal Sum Subsets. Among others we present (1) a framework for obtaining NP-hardness proofs and pseudopolynomial time algorithms for Equal Sum Subsets variations, which we apply to variants of the problem with additional selection restrictions, (2) a proof of NP-hardness and a pseudo-polynomial time algorithm for the case where we ask for two subsets such that the ratio of their sums is some fixed rational r > 0, (3) a pseudo-polynomial time algorithm for finding k subsets of equal sum, with k = O(1), and a proof of strong NP-hardness for the same problem with k = Ω(n), (4) algorithms and hardness results for finding k equal sum subsets under the additional requirement that the subsets should be of equal cardinality. Our results are a step towards determining the dividing lines between polynomial time solvability, pseudo-polynomial time solvability, and strong NP-completeness of subsetsum related problems. ACM CCS
منابع مشابه
Equal Sum Subsets: Complexity of Variations
We start an investigation into the complexity of variations of the Equal Sum Subsets problem, a basic problem in which we are given a set of numbers and are asked to nd two disjoint subsets of the numbers that add up to the same sum. While Equal Sum Subsets is known to be NP-complete, only very few studies have investigated the complexity of its variations. In this paper, we show NP-completenes...
متن کاملEqual Sum Subsets : Complexity of
We start an investigation into the complexity of variations of the Equal Sum Subsets problem, a basic problem in which we are given a set of numbers and are asked to nd two disjoint subsets of the numbers that add up to the same sum. While Equal Sum Subsets is known to be NP-complete, only very few studies have investigated the complexity of its variations. In this paper, we show NP-completenes...
متن کاملThe Effects of Task Variation on the Accuracy and Complexity of Iranian EFL Learners’ Oral Performance
Task variation is an integrative method aiming at the importance of learner-to-learner interactions in a wide range of learning contexts and fostering authentic use of language and meaningful communication. This study investigated the impact of task variation on the accuracy and complexity of Iranian EFL learners’ oral speech. In so doing, 80 intermediate EFL learners, majoring English at the I...
متن کاملThe Knowledge Translation Complexity Network (KTCN) Model: The Whole Is Greater Than the Sum of the Parts - A Response to Recent Commentaries
متن کامل
On the Structure of Metric-like Spaces
The main purpose of this paper is to introduce several concepts of the metric-like spaces. For instance, we define concepts such as equal-like points, cluster points and completely separate points. Furthermore, this paper is an attempt to present compatibility definitions for the distance between a point and a subset of a metric-like space and also for the distance between two subsets of a metr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Nord. J. Comput.
دوره 14 شماره
صفحات -
تاریخ انتشار 2008